On binary reflected Gray codes and functions

The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the jth letter of the kth word of the binary reflected Gray code of length n, is (2n − 2n−j − 1 [2n − 2n−j−1 − k/2]) mod 2, by replacing the binomial coefficient by [(k-1)/(2n-j+1)+1/2].